[Paper] Speed up in Computation of HMAX Features for Object Localization
نویسندگان
چکیده
منابع مشابه
High-speed object matching and localization using gradient orientation features
In many robotics and automation applications, it is often required to detect a given object and determine its pose (position and orientation) from input images with high speed, high robustness to photometric changes, and high pose accuracy. We propose a new object matching method that improves efficiency over existing approaches by decomposing orientation and position estimation into two cascad...
متن کاملComputation of Generic Features for Object Classification
In this article we learn significant local appearance features for visual classes. Generic feature detectors are obtained by unsupervised learning using clustering. The resulting clusters, referred to as “classtons”, identify the significant class characteristics from a small set of sample images. The classton channels mark these characteristics reliably using a probabilistic cluster representa...
متن کاملThe Combination of HMAX and HOGs in an Attention Guided Framework for Object Localization
Object detection and localization is a challenging task. Among several approaches, more recently hierarchical methods of feature-based object recognition have been developed and demonstrated high-end performance measures. Inspired by the knowledge about the architecture and function of the primate visual system, the computational HMAX model has been proposed. At the same time robust visual obje...
متن کاملSpeed-Up Theorems in Type-2 Computation
A classic result known as the speed-up theorem in machineindependent complexity theory shows that there exist some computable functions that do not have best programs for them [2, 3]. In this paper we lift this result into type-2 computation under the notion of our type2 complexity theory depicted in [15, 13, 14]. While the speed-up phenomenon is essentially inherited from type-1 computation, w...
متن کاملA Speed-Up Technique for Distributed Shortest Paths Computation
We propose a simple and practical speed-up technique, which can be combined with every distance vector routing algorithm based on shortest paths, allowing to reduce the total number of messages sent by that algorithm. We combine the new technique with two algorithms known in the literature: DUAL, which is part of CISCO’s widely used EIGRP protocol, and the recent DUST, which has been shown to b...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ITE Transactions on Media Technology and Applications
سال: 2014
ISSN: 2186-7364
DOI: 10.3169/mta.2.60